Simultaneous matchings: Hardness and approximation

Simultaneous matchings: Hardness and approximation

Given a bipartite graph G = (X ∪̇ D, E ⊆ X × D), an X-perfect matching is a matching in G that covers every node in X. In this paper we study the following generalisation of the X-perfect matching problem, which has applications in constraint programming: Given a bipartite graph as above and a collection F ⊆ 2 of k subsets of X, find a subset M ⊆ E of the edges such that for each C ∈ F , the edg...

Simultaneous Matchings

Given a bipartite graph G = (X ∪̇ D, E ⊆ X × D), an Xperfect matching is a matching in G that saturates every node in X. In this paper we study the following generalisation of the X-perfect matching problem, which has applications in constraint programming: Given a bipartite graph as above and a collection F ⊆ 2 of k subsets of X, find a subset M ⊆ E of the edges such that for each C ∈ F , the e...

Simultaneous Matchings Dynamic Graphs

Approximation algorithms and the hardness of approximation

Chandra Chekuri (Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL), Joseph Cheriyan (Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, ON), Ryan O’Donnell (School of Computer Science, Carnegie Mellon University, Pittsburgh, PA), Mohammad R. Salavatipour (Dept. of Computing Science, University of Alberta, Edmonton, AL), David Williamson (...

Approximation Algorithms and Hardness of Approximation

S (in alphabetic order by speaker surname) Speaker: Hyung-Chan An (EPFL, Lausanne) Title: LP-Based Algorithms for Capacitated Facility Location Abstract: Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algori...